Complete Rewriting System for the Chinese Monoid
نویسندگان
چکیده
In this paper we are interested in the Chinese monoid and show that the Chinese monoid has complete rewriting system. Mathematics Subject Classification: 16S15; 20F05; 20F10; 20M50; 68Q42
منابع مشابه
Rewriting systems and biautomatic structures for Chinese, hypoplactic, and Sylvester monoids
This paper studies complete rewriting systems and biautomaticity for three interesting classes of finite-rank homogeneous monoids: Chinese monoids, hypoplactic monoids, and Sylvester monoids. For Chinese monoids, we first give new presentations via finite complete rewriting systems, using more lucid constructions and proofs than those given independently by Chen & Qui and Güzel Karpuz; we then ...
متن کاملFinite Derivation Type Property on the Chinese Monoid
Squier introduced the notion finite derivation type which is a combinatorial condition satisfied by certain rewriting systems. The main result in this paper states that the Chinese monoid has finite derivation type property. Mathematics Subject Classification: 16S15; 20F05; 20F10; 20M50; 68Q42
متن کاملComplete involutive rewriting systems
Given a monoid string rewriting system M , one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is well known that this algorithm is equivalent to computing a noncommutative Gröbner basis for M . This article develops an alternative approach, using noncommutative involutive basis methods to obtain a complete involuti...
متن کاملFinite Complete Rewriting Systems and Finite Derivation Type for Small Extensions of Monoids
Let S be a monoid and let T be a submonoid of nite index in S. The main results in this paper state that S can be presented by a nite complete rewriting system if T can, and S has nite derivation type if T has.
متن کاملMonomial Orderings, Rewriting Systems, and Gröbner Bases for the Commutator Ideal of a Free Algebra
In this paper we consider a free associative algebra on three generators over an arbitrary field K. Given a term ordering on the commutative polynomial ring on three variables over K, we construct uncountably many liftings of this term ordering to a monomial ordering on the free associative algebra. These monomial orderings are total well orderings on the set of monomials, resulting in a set of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010